Path-Bounded One-Way Multihead Finite Automata

For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head finite automaton, but not accepted by any r path-bounded one-way nondeterministic k head finite automaton whether or not simple. key words: one-way multihead finite automata, simple one-way multihead finite automata, path-bounded computation, degree of nondeterminism